A Novel Collaborative Partner Selection algorithm Based on Nash Bargaining Game and Hungarian Method for Wireless Networks

—In this paper, the problem sharing resource among selfish nodes and cooperative partner selection are considered in wireless networks. Each wireless node can act as not only a source, but also a potential relay in the system model. The cooperative partners are willing to jointly adjust their power levels and channel bandwidth for cooperative relaying so that an extra rate increase can be achieved. In order to bargain joint bandwidth and power allocation (JBPA) between cooperative partners, a two-user Nash bargaining solution (NBS) is proposed. Then, based on Hungarian method, multiple-user bargaining algorithm and multiple-user grouping algorithm are developed to solve partner selection in large network. By using the proposed multi-user algorithm, the optimal coalitions are formed and the rate increase of overall network is also maximized. Simulation results indicate that the total rate increment based on grouping algorithm is fully close to the optimum, and the resource allocation fairness is dependent on how much rate increase its partner can make to. All in all, based on JBPA, each user negotiates with its partner and a fair NBS is achieved. Then the optimal coalition pairs based on the Hungarian method can be determined with a limited centralized control (such as base station) for the whole network efficiency.